Видео с ютуба Lattices: Geometry Algorithms And Hardness

New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks

New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks
An LLL Algorithm for Module Lattices

An LLL Algorithm for Module Lattices
On Approximating the Covering Radius and Finding Dense Lattice Subspaces

On Approximating the Covering Radius and Finding Dense Lattice Subspaces
How big is the shaded area?

How big is the shaded area?
Lattice Packings: An Upper Bound on the Number of Perfect Lattices

Lattice Packings: An Upper Bound on the Number of Perfect Lattices
On Minimal Support for Lattices and Semigroups

On Minimal Support for Lattices and Semigroups
The 5 Lattices

The 5 Lattices
Coloring the Voronoi Tesselation of Lattices

Coloring the Voronoi Tesselation of Lattices
Short Simplex Paths in Lattice Polytopes

Short Simplex Paths in Lattice Polytopes
Algorithms for the k-List Problems

Algorithms for the k-List Problems
Challenges in Evaluating Costs of known Lattice Attacks

Challenges in Evaluating Costs of known Lattice Attacks
Algorithms for Algebraic Lattices: Classical and Quantum

Algorithms for Algebraic Lattices: Classical and Quantum
Lattice cryptography: A new unbreakable code

Lattice cryptography: A new unbreakable code
Algorithms for Lattice Problems

Algorithms for Lattice Problems
A Reverse Minkowski Theorem

A Reverse Minkowski Theorem
Successive Minima-Type Inequalities

Successive Minima-Type Inequalities
Provable Sieving Algorithms for SVP and CVP in the l_p norm

Provable Sieving Algorithms for SVP and CVP in the l_p norm
Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes

Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes